#include<bits/stdc++.h>
using namespace std;
int n,s[100010],cnt,vis[100010];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d", &n);
    int m = n;
    for (int i = 1; i <= n; ++i)
    {
        int temp;
        scanf("%d", &temp);
        if (!vis[temp])
            s[++cnt] = temp;
        vis[temp]++;
    }
    sort(s + 1, s + cnt + 1);
    for (int i = 2; i <= cnt; ++i)
    {
        int k = vis[s[i]];
        for (int j = i - 1; j >= 1; --j)
        {
            if (vis[s[j]])
            {
                m -= min(vis[s[j]],k);
                if (k > vis[s[j]])
                {
                    k -= vis[s[j]];
                    vis[s[j]] = 0;
                    continue;
                }
                if (k <= vis[s[j]])
                {
                    vis[s[j]] -= k;
                    break;
                }
            }

        }
    }
    cout << m;
    return 0;
}
